Search results for "Close-enough arc routing problem"

showing 2 items of 2 documents

A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem

2016

The generalized directed rural postman problem, also known as the close-enough arc routing problem, is an arc routing problem with some interesting real-life applications, such as routing for meter reading. In this article we introduce two new formulations for this problem as well as various families of new valid inequalities that are used to design and implement a branch-and-cut algorithm. The computational results obtained on test bed instances from the literature show that this algorithm outperforms the existing exact methods

050210 logistics & transportationMathematical optimization021103 operations research05 social sciences0211 other engineering and technologiesTransportation02 engineering and technologyTravelling salesman problemClose-enough arc routing problemBranch-and-cut0502 economics and businessGeneralized rural postman problemRouting (electronic design automation)MATEMATICA APLICADABranch and cutArc routingAlgorithmAutomatic meter readingCivil and Structural EngineeringMathematics
researchProduct

Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem

2017

[EN] The generalized directed rural postman problem is an arc routing problem with many interesting real-life applications, such as routing for meter reading. In this application, a vehicle with a receiver travels through a series of neighborhoods. If the vehicle gets closer than a certain distance to a meter, the receiver is able to record the gas, water, or electricity consumption. Therefore, the vehicle does not need to traverse every street, but only a few, to get close enough to each meter. We study an extension of this problem in which a fleet of vehicles is available. Given the characteristics of the mentioned application, the vehicles have no capacities but there is a maximum distan…

90C27Mathematical optimizationControl and OptimizationTraverseManagement Science and Operations ResearchMathematicsT57-57.97Applied mathematics. Quantitative methodsSeries (mathematics)Extension (predicate logic)90C1090B99QA75.5-76.9590C57Constraint (information theory)Computational MathematicsClose-enough arc routing problemBranch-and-cutModeling and SimulationElectronic computers. Computer scienceRouting (electronic design automation)Distance constrainedMATEMATICA APLICADABranch and cutArc routingAlgorithmAutomatic meter readingMultivehicleGeneralized directed rural postman problem
researchProduct